Inequivalent Representations of Bias Matroids
نویسنده
چکیده
Suppose that q is a prime power exceeding five. For every integer N there exists a 3-connected GF(q)-representable matroid, in particular, a free spike or a free swirl, that has at least N inequivalent GF(q)-representations. In contrast to this, Geelen, Oxley, Vertigan and Whittle have conjectured that, for any integer r > 2, there exists an integer n(q, r) such that if M is a 3-connected GF(q)-representable matroid and M has no rank-r free-swirl or rank-r free-spike minor, then M has at most n(q, r) inequivalent GF(q)-representations. The main result of this paper is a proof of this conjecture for Zaslavsky’s class of bias matroids.
منابع مشابه
On Totally Free Expansions of Matroids
The aim of this paper is to give insight into the behaviour of inequivalent representations of 3{connected matroids. An element x of a matroid M is xed if there is no extension M 0 of M by an element x 0 such that fx;x 0 g is independent and M 0 is unaltered by swapping the labels on x and x 0. When x is xed, a representation of M nx extends in at most one way to a representation of M. A 3{conn...
متن کاملStabilizer theorems for even cut matroids
A graft is a representation of an even cut matroid M if the cycles of M correspond to the even cuts of the graft. Two, long standing, open questions regarding even cut matroids are the problem of finding an excluded minor characterization and the problem of efficiently recognizing this class of matroids. Progress on these problems has been hampered by the fact that even cut matroids can have an...
متن کاملTotally Free Expansions of Matroids
The aim of this paper is to give insight into the behaviour of inequivalent representations of 3-connected matroids. An element x of a matroid M is fixed if there is no extension MŒ of M by an element xŒ such that {x, xŒ} is independent and MŒ is unaltered by swapping the labels on x and xŒ. When x is fixed, a representation of M0x extends in at most one way to a representation of M. A 3-connec...
متن کاملStabilizer theorems for even cycle matroids
A signed graph is a representation of an even cycle matroid M if the cycles of M correspond to the even cycles of that signed graph. Two, long standing, open questions regarding even cycle matroids are the problem finding an excluded minor characterization and the problem of efficiently recognizing this class of matroids. Progress on these problems has been hampered by the fact that even cycle ...
متن کاملInequivalent representations of matroids having no U3, 6-minor
It is proved that, for any prime power q; a 3-connected matroid with no U3;6-minor has at most ðq 2Þ! inequivalent representations over GFðqÞ: r 2004 Elsevier Inc. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 14 شماره
صفحات -
تاریخ انتشار 2005